import java.util.Stack;

public class Solution {
    public boolean IsPopOrder(int[]pushV,int[]popV){
        Stack<Integer>stack=new Stack<>();
        int j=0;
        for (int i = 0; i < pushV.length ; i++) {

            stack.push(pushV[i]);
            while (j< popV.length&&!stack.empty()&&stack.peek()==popV[j]){
                stack.pop();
                j++;
            }
        }
        return stack.empty();
    }
}
